Using Weakest Preconditions to Simplify Integrity Constraint Checking
نویسندگان
چکیده
We present a procedure for deriving the weakest precondition for a database update and an integrity constraint. We show how to simplify the weakest precondition to produce a condition to be evaluated before the update is performed. This provides an efficient means to ensure that database updates maintain integrity constraints.
منابع مشابه
Assertion Support for Manipulating Constrained Data-Centric XML
XML is used for different purposes. We are interested in data-centric applications of XML where it is used to handle structured data in loosely coupled, distributed systems. In many such scenarios, it is important that the XML data complies to structural and integrity constraints, in particular to value-based constraints. The constraints should remain invariant under operations manipulating the...
متن کاملEnforcement of Integrity Constraints in Recursive Databases
Integrity constraint(ic) enforcement forms an essential component in deductive database processing. Some interesting methods which enforce integrity constraints have been proposed by Topor, Lloyd, Decker, Kowalski, Sadri, Soper, Martens, Bruynooghe, Yum and Henschen. In this thesis we further analyze and develop efficient simplification algorithms and methods for the enforcement of integrity co...
متن کاملPast-directed Evaluation of Dynamic Integrity Constraints in Temporal Databases
This work can be considered a step to simplify the dynamic integrity constraint checking. We propose a method to transform a dynamic constraint to an equivalent past-directed form. This transformation will facilitate the constraint checking in temporal databases. The method proposed deals with integrity constraints defined by first-order logic formulas with explicit time in a denial form. It is...
متن کاملMaintaining XML Data Integrity in Programs An Abstract Datatype Approach
In service-oriented loosely coupled distributed information systems, the format and semantics of the exchanged data become more and more important. We envisage that there will be an increasing number of general and domain-specific XML-based data formats for service-oriented computing. A typical example is a tax declaration form. If the schemas defining the formats specify structural and additio...
متن کاملVerifying and Generating WP Transformers for Procedures on Complex Data
We present the formalized theory of a weakest precondition calculus for procedures on complex data with integrity constraints. The theory defines the assertion language and the wp-transformer. It contains the proofs for soundness and “weakestness” of the preconditions. Furthermore, we formalize a normalization process that eliminates all elementary updates from preconditions. This normalization...
متن کامل